Efficient DNS based Load Balancing for Bursty Web Application Traffic

This research proposes a new efficient load balancing algorithm which applies to the local Domain Name Service (DNS) server for web based applications and services to ease the sudden increase in demand for the services. Owing to the existing load balancing algorithms still experience server’s resource congestion and slow connection to the system resulted by sudden bursty demand of services especially during special events. This is mainly due to the unbalanced distribution of workload and the insufficient of physical computing resources in service provision. To overcome this problem, most web based application service providers will have to constantly improve the capacity of their physical computing resources by either adding new server nodes to the existing server farm or renting cloud computing resources from cloud computing service provider to meet the sudden demands of the end users during the peak period. However, it is not economical to maneuver and reconfigure huge amount of permanent computing resources just to satisfy the instantaneous and short period of service demand. As a result, the need to have a more efficient load balancing algorithm which can adaptively utilize the resources available in the farm of computing resources will be of advantageous. The new algorithm will be able to directly decrease the operation cost and web services will no longer be interrupted by sudden high demand of traffic request. The proposed algorithm is evaluated via computer simulation and modeling where its performance is verified against the few selected algorithms of the same nature. Enhancement on the DNS system for load balancing is beneficial to most organizations such as government agencies and service providers running their own local DNS service, which allow the proposed algorithm to be easily implemented. Moreover, DNS setup is standard across the IP networks hence the adoption can be easy achieved with minimal changes without altering the architecture of the services provided especially in coding as well as physical set up of the server farm itself

An Analytical Study of LEACH Routing Protocol for Wireless Sensor Network

—The use of low power sensor nodes to collect useful sensing information effectively is critical for any wireless sensor network (WSN) application to last longer. To increase network lifetime, energy consumption is considered as one of an essential performance metric. Most of the current proposed routing protocols proposed to reduce the amount of energy consumed and to increase the network lifetime. The common pioneer hierarchical routing protocol for wsn such as Low Energy Adaptive Cluster Hierarchical Routing (LEACH) is also proposed to improve the energy efficiency of WSN. LEACH is a cluster based routing protocol in which sensor nodes are combined together to form separate clusters and every cluster has a leader node named cluster head (CH). In this paper, we have done the analytical study of LEACH protocol to identify to what extent LEACH protocol can perform in terms of average energy consumption and packet loss for different data rate

Adaptive Checkpoint Interval Algorithm Considering Task Deadline and Lifetime Reliability for Real-Time System

AbstractCheckpointing mechanism is used to tolerate the impact of transient faults by rollback operation. Recently, it has also been used as a mechanism to enhance system's lifetime by identifying and tolerating permanent fault 5,19,10,12. However, equidistant checkpoint interval may cause task deadline violation in the system. Here, we propose an adaptive checkpoint interval placement algorithm (ADeLiRACI) that meets all tasks deadline. The checkpoint intervals are adjusted to minimize the impact of stresses and permanent faults on the running hosts. This novel mechanism allows greater applicability in real time systems with hard deadline such as weather prediction, financial transactions etc. We compare the estimated completion time for increasing fault-rate in the system against five existing algorithms. For all applications, ADeLiRACI is able to meet the hard deadline along with enhancing lifetime reliability of the system